منابع مشابه
The clique partitioning problem: Facets and patching facets
The clique partitioning problem (CPP) can be formulated as follows: Given is a complete graph G = (V, E), with edge weights wij ∈ R for all {i, j} ∈ E. A subset A ⊆ E is called a clique partition if there is a partition of V into nonempty, disjoint sets V1, . . . , Vk , such that each Vp (p = 1, . . . ,k) induces a clique (i.e., a complete subgraph), and A = ∪ p=1 {{i, j}|i, j ∈ Vp , i ≠ j}. Th...
متن کاملA Parallel Neural Networks Algorithm for the Clique Partitioning Problem
This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. Given a graph G = (V, E) , a clique is a complete subgraph in G. The clique partitioning problem is to partition the vertices in G into a number of cliques such that each vertex appears in one and only one clique. The clique partitioning problem has important applications in many areas inc...
متن کاملAn Iterated Tabu Search Approach for the Clique Partitioning Problem
Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over all cliques induced by the subsets is as small as possible. We develop an iterated tabu searc...
متن کاملLagrangian relaxation and pegging test for the clique partitioning problem
The clique partitioning problem is an NP-hard combinatorial optimization problem with applications to data analysis such as clustering. Though a binary integer linear programming formulation has been known for years, one needs to deal with a huge number of variables and constraints when solving a large instance. In this paper, we propose a size reduction algorithm which is based on the Lagrangi...
متن کاملBranch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
Given a complete graph Kn = (V, E) with edge weight ce on each edge, we consider the problem of partitioning the vertices of graph Kn into subcliques that have at least S vertices, so as to minimize the total weight of the edges that have both endpoints in the same subclique. In this paper, we consider using the branch-and-price method to solve the problem. We demonstrate the necessity of cutti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90001-k